0.07/0.12 % Problem : SLH384^1 : TPTP v7.5.0. Released v7.5.0. 0.07/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n008.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 30 0.13/0.34 % WCLimit : 30 0.13/0.34 % DateTime : Tue Aug 9 02:57:24 EDT 2022 0.13/0.34 % CPUTime : 0.20/0.49 The problem SPC is TH0_THM_EQU_NAR 0.20/0.49 Running higher-order on 1 cores theorem proving 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.49 # Version: 3.0pre003-ho 0.35/0.60 # Preprocessing class: HSLSSMSMSSSNSFA. 0.35/0.60 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.35/0.60 # Starting new_ho_10 with 30s (1) cores 0.35/0.60 # new_ho_10 with pid 29521 completed with status 0 0.35/0.60 # Result found by new_ho_10 0.35/0.60 # Preprocessing class: HSLSSMSMSSSNSFA. 0.35/0.60 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.35/0.60 # Starting new_ho_10 with 30s (1) cores 0.35/0.60 # No SInE strategy applied 0.35/0.60 # Search class: HGHSM-FSLM31-MSFFFFBN 0.35/0.60 # Scheduled 4 strats onto 1 cores with 30 seconds (30 total) 0.35/0.60 # Starting new_ho_10 with 19s (1) cores 0.35/0.60 # new_ho_10 with pid 29527 completed with status 0 0.35/0.60 # Result found by new_ho_10 0.35/0.60 # Preprocessing class: HSLSSMSMSSSNSFA. 0.35/0.60 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.35/0.60 # Starting new_ho_10 with 30s (1) cores 0.35/0.60 # No SInE strategy applied 0.35/0.60 # Search class: HGHSM-FSLM31-MSFFFFBN 0.35/0.60 # Scheduled 4 strats onto 1 cores with 30 seconds (30 total) 0.35/0.60 # Starting new_ho_10 with 19s (1) cores 0.35/0.60 # Preprocessing time : 0.007 s 0.35/0.60 # Presaturation interreduction done 0.35/0.60 0.35/0.60 # Proof found! 0.35/0.60 # SZS status Theorem 0.35/0.60 # SZS output start CNFRefutation 0.35/0.60 thf(decl_22, type, abs_abs_int: int > int). 0.35/0.60 thf(decl_23, type, abs_abs_poly_real: poly_real > poly_real). 0.35/0.60 thf(decl_24, type, abs_abs_real: real > real). 0.35/0.60 thf(decl_25, type, minus_minus_int: int > int > int). 0.35/0.60 thf(decl_26, type, minus_minus_nat: nat > nat > nat). 0.35/0.60 thf(decl_27, type, minus_240770701y_real: poly_real > poly_real > poly_real). 0.35/0.60 thf(decl_28, type, minus_minus_real: real > real > real). 0.35/0.60 thf(decl_29, type, one_one_int: int). 0.35/0.60 thf(decl_30, type, one_one_nat: nat). 0.35/0.60 thf(decl_31, type, one_one_poly_real: poly_real). 0.35/0.60 thf(decl_32, type, one_one_real: real). 0.35/0.60 thf(decl_33, type, zero_zero_int: int). 0.35/0.60 thf(decl_34, type, zero_zero_nat: nat). 0.35/0.60 thf(decl_35, type, zero_zero_poly_int: poly_int). 0.35/0.60 thf(decl_36, type, zero_zero_poly_nat: poly_nat). 0.35/0.60 thf(decl_37, type, zero_z1423781445y_real: poly_poly_real). 0.35/0.60 thf(decl_38, type, zero_zero_poly_real: poly_real). 0.35/0.60 thf(decl_39, type, zero_zero_real: real). 0.35/0.60 thf(decl_40, type, ring_1_of_int_int: int > int). 0.35/0.60 thf(decl_41, type, ring_11511526659y_real: int > poly_real). 0.35/0.60 thf(decl_42, type, ring_1_of_int_real: int > real). 0.35/0.60 thf(decl_43, type, ord_less_int: int > int > $o). 0.35/0.60 thf(decl_44, type, ord_less_nat: nat > nat > $o). 0.35/0.60 thf(decl_45, type, ord_less_poly_real: poly_real > poly_real > $o). 0.35/0.60 thf(decl_46, type, ord_less_real: real > real > $o). 0.35/0.60 thf(decl_47, type, ord_less_eq_int: int > int > $o). 0.35/0.60 thf(decl_48, type, ord_less_eq_nat: nat > nat > $o). 0.35/0.60 thf(decl_49, type, ord_le1180086932y_real: poly_real > poly_real > $o). 0.35/0.60 thf(decl_50, type, ord_less_eq_real: real > real > $o). 0.35/0.60 thf(decl_51, type, algebraic_real: real > $o). 0.35/0.60 thf(decl_52, type, poly_int2: poly_int > int > int). 0.35/0.60 thf(decl_53, type, poly_nat2: poly_nat > nat > nat). 0.35/0.60 thf(decl_54, type, poly_poly_real2: poly_poly_real > poly_real > poly_real). 0.35/0.60 thf(decl_55, type, poly_real2: poly_real > real > real). 0.35/0.60 thf(decl_56, type, power_power_int: int > nat > int). 0.35/0.60 thf(decl_57, type, power_power_nat: nat > nat > nat). 0.35/0.60 thf(decl_58, type, power_2108872382y_real: poly_real > nat > poly_real). 0.35/0.60 thf(decl_59, type, power_power_real: real > nat > real). 0.35/0.60 thf(decl_60, type, field_1537545994s_real: set_real). 0.35/0.60 thf(decl_61, type, divide_divide_int: int > int > int). 0.35/0.60 thf(decl_62, type, divide_divide_nat: nat > nat > nat). 0.35/0.60 thf(decl_63, type, divide1727078534y_real: poly_real > poly_real > poly_real). 0.35/0.60 thf(decl_64, type, divide_divide_real: real > real > real). 0.35/0.60 thf(decl_65, type, collect_real: (real > $o) > set_real). 0.35/0.60 thf(decl_66, type, member_real: real > set_real > $o). 0.35/0.60 thf(decl_67, type, a: real). 0.35/0.60 thf(decl_68, type, a2: real). 0.35/0.60 thf(decl_69, type, a_set: set_real). 0.35/0.60 thf(decl_70, type, m: real). 0.35/0.60 thf(decl_71, type, a3: int). 0.35/0.60 thf(decl_72, type, b: int). 0.35/0.60 thf(decl_73, type, n: nat). 0.35/0.60 thf(decl_74, type, p: poly_real). 0.35/0.60 thf(decl_75, type, roots: set_real). 0.35/0.60 thf(decl_76, type, thesis: $o). 0.35/0.60 thf(decl_77, type, x: real). 0.35/0.60 thf(decl_78, type, esk1_2: real > nat > int). 0.35/0.60 thf(decl_79, type, esk2_2: real > nat > int). 0.35/0.60 thf(decl_80, type, esk3_3: int > int > (int > $o) > int). 0.35/0.60 thf(decl_81, type, esk4_3: int > int > (int > $o) > int). 0.35/0.60 thf(decl_82, type, esk5_1: real > real). 0.35/0.60 thf(decl_83, type, esk6_1: real > real). 0.35/0.60 thf(decl_84, type, esk7_1: (nat > $o) > nat). 0.35/0.60 thf(decl_85, type, esk8_1: (nat > $o) > nat). 0.35/0.60 thf(decl_86, type, esk9_2: (nat > $o) > nat > nat). 0.35/0.60 thf(decl_87, type, esk10_1: (nat > $o) > nat). 0.35/0.60 thf(decl_88, type, epred1_1: set_real > real > $o). 0.35/0.60 thf(conj_0, conjecture, (ord_less_real @ (divide_divide_real @ a2 @ (power_power_real @ (ring_1_of_int_real @ b) @ n)) @ (divide_divide_real @ (divide_divide_real @ one_one_real @ m) @ (power_power_real @ (ring_1_of_int_real @ b) @ n))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.35/0.60 thf(fact_270_divide__strict__right__mono, axiom, ![X6:real, X187:real, X46:real]:(((ord_less_real @ X6 @ X187)=>((ord_less_real @ zero_zero_real @ X46)=>(ord_less_real @ (divide_divide_real @ X6 @ X46) @ (divide_divide_real @ X187 @ X46))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_270_divide__strict__right__mono)). 0.35/0.60 thf(fact_3_A__less_I2_J, axiom, (ord_less_real @ a2 @ (divide_divide_real @ one_one_real @ m)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_A__less_I2_J)). 0.35/0.60 thf(fact_188_zero__less__power, axiom, ![X6:real, X8:nat]:(((ord_less_real @ zero_zero_real @ X6)=>(ord_less_real @ zero_zero_real @ (power_power_real @ X6 @ X8)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_188_zero__less__power)). 0.35/0.60 thf(fact_115_of__int__0__less__iff, axiom, ![X5:int]:(((ord_less_real @ zero_zero_real @ (ring_1_of_int_real @ X5))<=>(ord_less_int @ zero_zero_int @ X5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_115_of__int__0__less__iff)). 0.35/0.60 thf(fact_1_b, axiom, (ord_less_int @ zero_zero_int @ b), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_b)). 0.35/0.60 thf(c_0_6, negated_conjecture, ~(ord_less_real @ (divide_divide_real @ a2 @ (power_power_real @ (ring_1_of_int_real @ b) @ n)) @ (divide_divide_real @ (divide_divide_real @ one_one_real @ m) @ (power_power_real @ (ring_1_of_int_real @ b) @ n))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.35/0.60 thf(c_0_7, plain, ![X1430:real, X1431:real, X1432:real]:((~(ord_less_real @ X1430 @ X1431)|(~(ord_less_real @ zero_zero_real @ X1432)|(ord_less_real @ (divide_divide_real @ X1430 @ X1432) @ (divide_divide_real @ X1431 @ X1432))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_270_divide__strict__right__mono])])). 0.35/0.60 thf(c_0_8, negated_conjecture, ~((ord_less_real @ (divide_divide_real @ a2 @ (power_power_real @ (ring_1_of_int_real @ b) @ n)) @ (divide_divide_real @ (divide_divide_real @ one_one_real @ m) @ (power_power_real @ (ring_1_of_int_real @ b) @ n)))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.35/0.60 thf(c_0_9, plain, ![X1:real, X6:real, X11:real]:(((ord_less_real @ (divide_divide_real @ X1 @ X11) @ (divide_divide_real @ X6 @ X11))|~((ord_less_real @ X1 @ X6))|~((ord_less_real @ zero_zero_real @ X11)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.35/0.60 thf(c_0_10, plain, (ord_less_real @ a2 @ (divide_divide_real @ one_one_real @ m)), inference(split_conjunct,[status(thm)],[fact_3_A__less_I2_J])). 0.35/0.60 thf(c_0_11, plain, ![X1257:real, X1258:nat]:((~(ord_less_real @ zero_zero_real @ X1257)|(ord_less_real @ zero_zero_real @ (power_power_real @ X1257 @ X1258)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_188_zero__less__power])])). 0.35/0.60 thf(c_0_12, negated_conjecture, ~((ord_less_real @ zero_zero_real @ (power_power_real @ (ring_1_of_int_real @ b) @ n))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])). 0.35/0.60 thf(c_0_13, plain, ![X3:nat, X1:real]:(((ord_less_real @ zero_zero_real @ (power_power_real @ X1 @ X3))|~((ord_less_real @ zero_zero_real @ X1)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.35/0.60 thf(c_0_14, plain, ![X1100:int]:(((~(ord_less_real @ zero_zero_real @ (ring_1_of_int_real @ X1100))|(ord_less_int @ zero_zero_int @ X1100))&(~(ord_less_int @ zero_zero_int @ X1100)|(ord_less_real @ zero_zero_real @ (ring_1_of_int_real @ X1100))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_115_of__int__0__less__iff])])). 0.35/0.60 thf(c_0_15, negated_conjecture, ~((ord_less_real @ zero_zero_real @ (ring_1_of_int_real @ b))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.35/0.60 thf(c_0_16, plain, ![X2:int]:(((ord_less_real @ zero_zero_real @ (ring_1_of_int_real @ X2))|~((ord_less_int @ zero_zero_int @ X2)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.35/0.60 thf(c_0_17, plain, (ord_less_int @ zero_zero_int @ b), inference(split_conjunct,[status(thm)],[fact_1_b])). 0.35/0.60 thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])]), ['proof']). 0.35/0.60 # SZS output end CNFRefutation 0.35/0.60 # Parsed axioms : 414 0.35/0.60 # Removed by relevancy pruning/SinE : 0 0.35/0.60 # Initial clauses : 623 0.35/0.60 # Removed in clause preprocessing : 76 0.35/0.60 # Initial clauses in saturation : 547 0.35/0.60 # Processed clauses : 998 0.35/0.60 # ...of these trivial : 16 0.35/0.61 # ...subsumed : 168 0.35/0.61 # ...remaining for further processing : 814 0.35/0.61 # Other redundant clauses eliminated : 63 0.35/0.61 # Clauses deleted for lack of memory : 0 0.35/0.61 # Backward-subsumed : 5 0.35/0.61 # Backward-rewritten : 19 0.35/0.61 # Generated clauses : 1231 0.35/0.61 # ...of the previous two non-redundant : 808 0.35/0.61 # ...aggressively subsumed : 0 0.35/0.61 # Contextual simplify-reflections : 0 0.35/0.61 # Paramodulations : 1159 0.35/0.61 # Factorizations : 4 0.35/0.61 # NegExts : 0 0.35/0.61 # Equation resolutions : 68 0.35/0.61 # Propositional unsat checks : 0 0.35/0.61 # Propositional check models : 0 0.35/0.61 # Propositional check unsatisfiable : 0 0.35/0.61 # Propositional clauses : 0 0.35/0.61 # Propositional clauses after purity: 0 0.35/0.61 # Propositional unsat core size : 0 0.35/0.61 # Propositional preprocessing time : 0.000 0.35/0.61 # Propositional encoding time : 0.000 0.35/0.61 # Propositional solver time : 0.000 0.35/0.61 # Success case prop preproc time : 0.000 0.35/0.61 # Success case prop encoding time : 0.000 0.35/0.61 # Success case prop solver time : 0.000 0.35/0.61 # Current number of processed clauses : 297 0.35/0.61 # Positive orientable unit clauses : 89 0.35/0.61 # Positive unorientable unit clauses: 1 0.35/0.61 # Negative unit clauses : 26 0.35/0.61 # Non-unit-clauses : 181 0.35/0.61 # Current number of unprocessed clauses: 785 0.35/0.61 # ...number of literals in the above : 2063 0.35/0.61 # Current number of archived formulas : 0 0.35/0.61 # Current number of archived clauses : 455 0.35/0.61 # Clause-clause subsumption calls (NU) : 22732 0.35/0.61 # Rec. Clause-clause subsumption calls : 17899 0.35/0.61 # Non-unit clause-clause subsumptions : 99 0.35/0.61 # Unit Clause-clause subsumption calls : 1448 0.35/0.61 # Rewrite failures with RHS unbound : 0 0.35/0.61 # BW rewrite match attempts : 17 0.35/0.61 # BW rewrite match successes : 6 0.35/0.61 # Condensation attempts : 998 0.35/0.61 # Condensation successes : 0 0.35/0.61 # Termbank termtop insertions : 56637 0.35/0.61 0.35/0.61 # ------------------------------------------------- 0.35/0.61 # User time : 0.093 s 0.35/0.61 # System time : 0.005 s 0.35/0.61 # Total time : 0.098 s 0.35/0.61 # Maximum resident set size: 4072 pages 0.35/0.61 0.35/0.61 # ------------------------------------------------- 0.35/0.61 # User time : 0.104 s 0.35/0.61 # System time : 0.007 s 0.35/0.61 # Total time : 0.111 s 0.35/0.61 # Maximum resident set size: 2232 pages 0.35/0.61 EOF